Coalition games over Kripke semantics: expressiveness and complexity
نویسندگان
چکیده
We show that Pauly’s Coalition Logic can be embedded into a richer normal modal logic that we call Normal Simulation of Coalition Logic (NCL). We establish that the latter is strictly more expressive than the former by proving that it is NEXPTIME complete in the case of at least two agents.
منابع مشابه
Quantified CTL: expressiveness and model checking
While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL coincides with Monadic Second-Order Logic for both semantics)...
متن کاملQuantified CTL : expressiveness and model checking ( Extended abstract ) Arnaud
While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL coincides with Monadic Second-Order Logic for both semantics)...
متن کاملEmbedding Coalition Logic in the Minimal Normal Multi-Modal Logic with Intersection
We present a satisfiability-preserving embedding of coalition logic into a normal modal logic. An advantage of standard, normal, modal logics is a well understood theoretical foundation and the availability of tools for automated verification and reasoning. The target logic is multi-modal K with intersection of modalities, interpreted over standard Kripke models corresponding to game structures...
متن کاملQuantified CTL: Expressiveness and Complexity
While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL coincides with Monadic Second-Order Logic for both semantics)...
متن کاملIndividual-based stability in hedonic games depending on the best or worst players
We consider classes of hedonic games in which each player’s preferences over coalition structures are induced by the best player (Band B-hedonic games) or the worst player (Wand W-hedonic games) in his coalition. For these classes, which allow for concise representation, we analyze the computational complexity of deciding the existence of and computing individually stable, Nash stable, and indi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007